Data-Parallel Primitives for Spatial Operations
نویسندگان
چکیده
Data-parallel primitives for performing operations on the PM1 quadtree, bucket PMR quadtree, and R-tree spatial data structures are presented using the scan model. Algorithms are described for building these three data structures that make use of these primitives. The data-parallel algorithms are assumed to be main memory resident. The algorithms were implemented on a minimally con gured Thinking Machines CM-5 with 32 processors containing 1GB of main memory. This work was supported in part by the National Science Foundation under Grant IRI-92-16970.
منابع مشابه
Parleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملData-Parallel Primitives for Spatial Operations Using PM Quadtrees*
Quadtrees* Erik G. Hoel Hanan Samet Computer Science Department Computer Science Department Center for Automation Research Center for Automation Research Institute for Advanced Computer Sciences Institute for Advanced Computer Sciences University of Maryland University of Maryland College Park, Maryland 20742 College Park, Maryland 20742 Abstract Data-parallel primitives for performing operatio...
متن کاملSpatial Relation Operations Based on V9i Model
Operations and description for spatial relations are important for GIS. At the present, investigations about them are mainly based on 9-intersection (9I) model for spatial relations. However, due to the infinity of the complements of objects in the model, it is difficult to directly capture the complements of objects. Therefore, even though most of spatial relations could be defined in the SDTS...
متن کاملOptimizing Parallel Prefix Operations for the Fermi Architecture 3
The NVIDIA Fermi GPU architecture introduces new instructions designed to facilitate basic, but important, parallel primitives on per-thread predicates, as well as instructions for manipulating and querying bits within a word. This chapter demonstrates the application of these instructions in the construction of efficient parallel algorithm primitives such as reductions, scans, and segmented sc...
متن کاملData Parallel Quadtree Indexing and Spatial Query Processing of Complex Polygon Data on GPUs
Fast growing computing power on commodity parallel hardware makes it both an opportunity and a challenge to use modern hardware for large-scale data management. While GPU (Graphics Processing Unit) computing is conceptually an excellent match for spatial data management which is both data and computing intensive, the complexity of multi-dimensional spatial indexing and query processing techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995